The Computational Complexity of the Kakuro Puzzle, Revisited
نویسندگان
چکیده
We present a new proof of NP-completeness for the problem of solving instances of the Japanese pencil puzzle Kakuro (also known as Cross-Sum). While the NP-completeness of Kakuro puzzles has been shown before [T. Seta. The complexity of CROSS SUM. IPSJ SIG Notes, AL-84:51–58, 2002], there are still two interesting aspects to our proof: we show NP-completeness for a new variant of Kakuro that has not been investigated before and thus improves the aforementioned result. Moreover some parts of the proof have been generated automatically, using an interesting technique involving SAT solvers.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملThe Use of Problem Domain Information in the Automated Solution of Kakuro Puzzles
Kakuro puzzle grids consist of overlapping continuous runs (collections of adjoined white cells) that are either exclusively horizontal or vertical. Constraints offer clues to their completion, achieved through the legal placement of values in the cells. To ascertain any potential applicability of Kakuro for real-world problems, it is first necessary to establish the underlying mathematical pro...
متن کاملComparing ASP and CP on Four Grid Puzzles
We study two declarative programming languages namely Answer Set Programming (ASP) and Constraint Programming (CP) on four grid puzzles: Akari, Kakuro, Nurikabe, and Heyawake. We represent these problems in both formalisms in a systematic way and compute their solutions using ASP system Clasp and CP system Comet. We compare the ASP approach with the CP approach both from the point of view of kn...
متن کاملIranian EFL Learners’ Motivation Construction: Integrative Motivation Revisited
Although Gardner and his associates’ work was most influential in the field of L2 motivation, from the early 1990s onwards, their work has been criticized for several reasons. Some researchers claimed that integrative and instrumental orientations were no longer able to convey the complexity of the L2 motivation construct. To examine this complexity, the present study attempted to investigate t...
متن کاملImpedance Control of Robots Using Voltage Control Strategy Revisited
In this note, we show that the impedance control strategy proposed in the paper is not feasible from practical implementation point of view. Next, a robust impedance controller is proposed for electrically driven robots using Fourier series (FS). The fact that robots' actuators have limited voltage is also considered in controller design procedure. In comparison with other impedance controllers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010